Preconditioned Conjugate Gradient Method for the Sparse Generalized Eigenvalue Problem in Electronic Structure Calculations
نویسندگان
چکیده
The use of localized basis sets is essential in linear-scaling electronic structure calculations, and since such basis sets are mostly non-orthogonal, it is necessary to solve the generalized eigenvalue problem Hx = "Sx. In this work, an iterative method for nd-ing the lowest few eigenvalues and corresponding eigenvectors for the generalized eigenvalue problem based on the conjugate gradient method is presented. The method is applied to rst-principles electronic structure calculations within density-functional theory using a localized spherical-wave basis set, rst introduced in the context of linear-scaling methods Comput. Phys. Commun. 102 (1997) 17]. The method exhibits linear convergence of the solution, the rate of which is improved by a preconditioning scheme using the kinetic energy matrix.
منابع مشابه
Hybrid preconditioning for iterative diagonalization of ill-conditioned generalized eigenvalue problems in electronic structure calculations
The iterative diagonalization of a sequence of large ill-conditioned generalized eigenvalue problems is a computational bottleneck in quantum mechanical methods employing nonorthogonal basis functions for ab initio electronic structure calculations. In this paper, we propose a hybrid preconditioning scheme to effectively combine global and locally accelerated preconditioners for rapid iterative...
متن کاملA geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems
In two previous papers by Neymeyr: A geometric theory for preconditioned inverse iteration I: Extrema of the Rayleigh quotient, LAA 322: (1-3), 61-85, 2001, and A geometric theory for preconditioned inverse iteration II: Convergence estimates, LAA 322: (1-3), 87-104, 2001, a sharp, but cumbersome, convergence rate estimate was proved for a simple preconditioned eigensolver, which computes the s...
متن کاملModern Building Materials, Structures and Techniques
The family of iterative methods for static and natural vibration analysis, based on preconditioned conjugate gradient (PCG) method with aggregation multilevel preconditioning, is considered. Both: the element-by-element procedure for assembling of stiffness matrix and sparse direct solver for it factoring and fast forward − backward substitutions ensure the high stability of methods against ill...
متن کاملNearly optimal preconditioned methods for hermitian eigenproblems under limited memory . Part I : Seeking one eigenvalue Andreas Stathopoulos July 2005
Large, sparse, Hermitian eigenvalue problems are still some of the most computationally challenging tasks. Despite the need for a robust, nearly optimal preconditioned iterative method that can operate under severe memory limitations, no such method has surfaced as a clear winner. In this research we approach the eigenproblem from the nonlinear perspective that helps us develop two nearly optim...
متن کاملPreconditioned Techniques For Large Eigenvalue Problems
This research focuses on nding a large number of eigenvalues and eigenvectors of a sparse symmetric or Hermitian matrix, for example, nding 1000 eigenpairs of a 100,000 100,000 matrix. These eigenvalue problems are challenging because the matrix size is too large for traditional QR based algorithms and the number of desired eigenpairs is too large for most common sparse eigenvalue algorithms. I...
متن کامل